Submodular Hamming Metrics
نویسندگان
چکیده
We show that there is a largely unexplored class of functions (positive polymatroids) that can define proper discrete metrics over pairs of binary vectors and that are fairly tractable to optimize over. By exploiting submodularity, we are able to give hardness results and approximation algorithms for optimizing over such metrics. Additionally, we demonstrate empirically the effectiveness of these metrics and associated algorithms on both a metric minimization task (a form of clustering) and also a metric maximization task (generating diverse k-best lists).
منابع مشابه
Weighted paths between partitions
Developing from a concern in bioinformatics, this paper analyses alternative metrics between partitions. From both theoretical and applicative perspectives, a seemingly most appropriate distance between any two partitions is HD, which counts the number of atoms finer than either one but not both. While faithfully reproducing the traditional Hamming distance between subsets, HD is very sensible ...
متن کاملSubmodular-Bregman and the Lovász-Bregman Divergences with Applications
We introduce a class of discrete divergences on sets (equivalently binary vectors) that we call the submodular-Bregman divergences. We consider two kinds, defined either from tight modular upper or tight modular lower bounds of a submodular function. We show that the properties of these divergences are analogous to the (standard continuous) Bregman divergence. We demonstrate how they generalize...
متن کاملSubmodular-Bregman and the Lovász-Bregman Divergences with Applications: Extended Version
We introduce a class of discrete divergences on sets (equivalently binary vectors)that we call the submodular-Bregman divergences. We consider two kinds ofsubmodular Bregman divergence, defined either from tight modular upper or tightmodular lower bounds of a submodular function. We show that the properties ofthese divergences are analogous to the (standard continuous) Bregman d...
متن کاملTesting Real-Valued Modularity and Submodularity
We study the question of testing whether a function f : {0, 1} → R is modular/submodular or ε-far from it (with respect to Hamming distance). We provide two results: First, it is possible to test using O( n ε logn ) queries whether f is modular (equivalently affine, or linear with a constant term). For constant ε, this improves upon a simple tester that uses O(n) queries. Second, we prove that ...
متن کاملOn the minimality of Hamming compatible metrics
A Hamming compatible metric is an integer-valued metric on the words of a finite alphabet which agrees with the usual Hamming distance for words of equal length. We define a new Hamming compatible metric, compute the cardinality of a sphere with respect to this metric, and show this metric is minimal in the class of all “well-behaved” Hamming compatible metrics.
متن کامل